Facets and facet subgraphs of symmetric edge polytopes

نویسندگان

چکیده

Symmetric edge polytopes, a.k.a. PV-type adjacency associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, dynamical systems. In particular, the authors are motivated by study of algebraic Kuramoto equations unmixed form whose Newton polytopes symmetric polytopes. The interplay between geometric structure topological underlying has a recurring theme recent studies. “facet/face subgraphs” emerged as one central concepts describing this symmetry. Continuing along line inquiry we provide complete description correspondence facets/faces polytope maximal bipartite subgraphs connected graph.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets

We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d = 6. This implies that for all pairs (d, n) with n−d ≤ 6 the diameter of the edge graph of a d-polytope with n facets is bounded by 6, which proves the Hirsch conjecture for all n − d ≤ 6. We show this result by showing this boun...

متن کامل

Facets of Secondary Polytopes

The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions ofA. While the vertices of the secondary polytope – corresponding to the triangulations ofA – are very well studied, there is not much known about the facets of the secondary polytope. The splits of a polytope, subdivisions with exactly two maximal faces, are t...

متن کامل

Volume, Facets and Dual Polytopes of Twinned Chain Polytopes

Let P and Q be finite partially ordered sets with |P | = |Q| = d, and C(P ) ⊂ R and C(Q) ⊂ R their chain polytopes. The twinned chain polytope of P and Q is the normal Gorenstein Fano polytope Γ(C(P ),−C(Q)) ⊂ R which is the convex hull of C(P )∪(−C(Q)). In this paper, we study combinatorial properties of twinned chain polytopes. First, we will give the formula of the volume of twinned chain po...

متن کامل

/ On Facets of Knapsack Equality Polytopes

The 0/1 knapsack equality polytope is, by deenition, the convex hull of 0/1 solutions of a single linear equation. A special form of this polytope | where the deening linear equation has nonnegative integer coeecients and the number of variables having co-eecient one exceeds the right-hand-side | is considered. Equality constraints of this form arose in a real-world application of integer progr...

متن کامل

Cycle-based facets of chromatic scheduling polytopes

Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, which supply wireless access to voice/data communication for customerswith fixed antennas and individual demands. This problem is N P -complete and, moreover, does not admit polynomial-time approximation algorithms with a fixed quality guarantee. As algorithms based on cut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2023

ISSN: ['1872-6771', '0166-218X']

DOI: https://doi.org/10.1016/j.dam.2022.11.015